∆-matroid and Jump System
نویسنده
چکیده
In [7, 10], the concept of pseudomatroid was developed as a proper generalization of the concept of matroid. The same concept was independently developed as ∆-matroid in [4, 5]. Throughout the paper, we use the more popular name ∆-matroid for this structure. In [6], the concept of ∆-matroid was further generalized to jump system. Further interesting results on jump system are reported in [1, 3, 12, 14, 15]. In this paper, we show that jump systems are, in some sense, equivalent to ∆-matroids. Using this equivalence and the ∆-matroid theory, we give simple proofs and extensions of many of the results on jump systems in [3, 6, 12]. In Section 2, we introduce notations and basic definitions. In Section 3, we give known and some new results on ∆-matroid. In Section 4, we prove equivalence between jump systems and ∆-matroids. We use this equivalence to give simple proofs of some of the known results on jump systems in Section 5.
منابع مشابه
Reduction of Jump Systems
A jump system is a set of integer lattice points satisfying an exchange axiom. We discuss an operation on lattice points, called reduction, that preserves the jump system two-step axiom. We use reduction to prove a weakened version of a matroid conjecture by Rota[7].
متن کاملThe Membership Problem in Jump Systems
A jump system is a set of lattice points satisfying a certain exchange axiom. This notion was introduced by Bouchet and Cunningham 2], as a common generalization of (among others) the sets of bases of a matroid and degree sequences of subgraphs of a graph. We prove, under additional assumptions, a min-max formula for the distance of a lattice point from a jump system. The conditions are met in ...
متن کاملOperations on M-Convex Functions on Jump Systems
A jump system is a set of integer points with an exchange property, which is a generalization of a matroid, a delta-matroid, and a base polyhedron of an integral polymatroid (or a submodular system). Recently, the concept of M-convex functions on constant-parity jump systems is introduced by Murota as a class of discrete convex functions that admit a local criterion for global minimality. M-con...
متن کاملLectures on Jump Systems Lectures on Jump Systems
This document contains notes that accompanied a series of four lectures on jump systems. These lectures were presented at the Center of Parallel Computing to an audience consisting mainly of graduate students. Abstract A jump system is a nonempty set of integral vectors that satisfy a certain exchange axiom. of Lovv asz. A degree system of a graph G is the set of degree sequences of all subgrap...
متن کاملEven factors, jump systems, and discrete convexity
A jump system, which is a set of integer lattice points with an exchange property, is an extended concept of a matroid. Some combinatorial structures such as the degree sequences of the matchings in an undirected graph are known to form a jump system. On the other hand, the maximum even factor problem is a generalization of the maximum matching problem into digraphs. When the given digraph has ...
متن کامل